A Hardware Engine for Genetic AlgorithmsTechnical Report UNL - CSE - 97 - 001 University of Nebraska - LincolnJuly 4 , 1997 Stephen

نویسندگان

  • Stephen D. Scott
  • Sharad Seth
  • Ashok Samal
چکیده

A genetic algorithm (GA) is an optimization method based on natural selection. Genetic algorithms have been applied to many hard optimization problems including VLSI layout optimization, boolean satis ability, power system control, fault detection, control systems, and signal processing. GAs have been recognized as a robust general-purpose optimization technique. But application of GAs to increasingly complex problems can overwhelm software implementations of GAs, causing unacceptable delays in the optimization process. This is true of any non-trivial application of GAs if the search space is large or if real-time performance is necessary. It follows that a hardware implementation of a GA is desirable for application to problems too complex for software-based GAs. Hardware's speed advantage and its ability to parallelize o er great rewards to genetic algorithms. Speedups of 1{2 orders of magnitude have been observed when frequently used software routines were implemented in hardware by way of eld-programmable gate arrays (FPGAs). Since most of the GA's operations are simple, a hardware implementation is feasible. Reprogrammability is essential in a general-purpose GA engine because certain GA modules require changeability (e.g. the function to be optimized by the GA). In hardware, reprogrammability is possible with FPGAs. Thus an FPGA-based GA is both feasible and desirable. A fully functional self-contained hardware-based genetic algorithm (the HGA) is presented here as a proof-of-concept system. It was designed using VHDL to allow for easy scalability. It is designed to act as a coprocessor with the CPU of a PC. The user programs the FPGAs which implement the function to be optimized. Other GA parameters may also be speci ed by the user. An analysis of the design is given that identi es the bottleneck of the HGA's pipeline under varying conditions. Simulation results of the HGA are also presented. A prototype HGA is described and compared to a similar GA implemented in software. In our tests, the prototype and simulations took two to ve percent as many clock cycles to run as the software-based GA. Suggested design improvements could dramatically increase the HGA's speed even further. Finally, we give other potential applications of the HGA which are feasible with current FPGA technology.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An aggregation procedure for simulating manufacturing flow line models

We develop a formal method for specifying an aggregate discrete-event simulation model of a production flow line manufacturing system. The methodology operates by aggregating production stations or resources of a flow line. Determining the specifications for representing the aggregated resources in a simulation model is the focus of our presentation. We test the methodology for a set of flow li...

متن کامل

An Online Survey Framework Using the Life Events Calendar

We describe an online survey framework programmed as a Java applet with a MySQL back-end. Our framework is built specifically as a Event History Calendar for the study of tobacco users and their behavior over a six month period. We introduce the notion of a Life Events Calendar and the relevance of an intelligent survey system in this context. We describe our methods and our component applicati...

متن کامل

Exploring Parameterized Relational Consistency

Consistency properties and algorithms for achieving them are at the heart of the success of Constraint Programming. For non-binary Constraint Satisfaction Problems (CSPs), the relational-consistency property R(i,j)C of [Dechter and van Beek 1997] may add new non-binary constraints to the constraint network, thus modifying its topology. The domain-filtering properties of [Bessière et al. 2008] f...

متن کامل

Automated Ontology Learning for a Semantic Web

By expressing web page content in a format that machines can understand, the semantic web provides huge possibilities for the Internet and for machine reasoning. Unfortunately, there is a considerable distance between the present-day World Wide Web and the semantic web of the future. The process of annotating the Web to make it semantic web-ready is quite long and not without resistance. In thi...

متن کامل

Information Portals: The Next Generation Catalog

Libraries today face an increasing challenge: to provide relevant information to diverse populations with differing needs, while competing with Web search engines like Google. In 2009 the University of Nebraska-Lincoln (UNL) Libraries joined with other libraries and Innovative Interfaces as development partners to design a new type of discovery tool. Information portals as a concept best suppor...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997